Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
نویسندگان
چکیده
A new public key encryption scheme, along with several variants, is proposed and analyzed. The scheme and its variants are quite practical, and are proved secure against adaptive chosen ciphertext attack under standard intractability assumptions. These appear to be the first publickey encryption schemes in the literature that are simultaneously practical and provably secure. This paper is a significantly revised and extended version of the extended abstract “A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack” [R. Cramer and V. Shoup, in Advances in Cryptology – Crypto ’98], and also includes results originally presented in the extended abstract “Using hash functions as a hedge against chosen ciphertext attack” [V. Shoup, in Advances in Cryptology – Eurocrypt 2000].
منابع مشابه
Revisit of chosen ciphertext secure public key encryption in standard model
We revisit the chosen ciphertext secure public key encryption schemes in standard model including Cramer-Shoup’s scheme(CS98) and KurosawaDesmedt’s scheme(KD04). We get the simplified version of CS98 and KD04. The simplified schemes are more efficient than the original schemes, and also provable secure against chosen ciphertext attack in standard model.
متن کاملUniversal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
We present several new and fairly practical public-key encryption schemes and prove them secure against adaptive chosen ciphertext attack. One scheme is based on Paillier’s Decision Composite Residuosity (DCR) assumption [7], while another is based in the classical Quadratic Residuosity (QR) assumption. The analysis is in the standard cryptographic model, i.e., the security of our schemes does ...
متن کاملChosen-Ciphertext Security from Identity-Based Encryption
We propose simple and efficient CCA-secure public-key encryption schemes (i.e., schemes secure against adaptive chosen-ciphertext attacks) based on any identity-based encryption (IBE) scheme. Our constructions have ramifications of both theoretical and practical interest. First, our schemes give a new paradigm for achieving CCA-security; this paradigm avoids “proofs of well-formedness” that hav...
متن کاملA Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
1 I n t r o d u c t i o n In this paper, we present and analyze a new public key cryptosystem that is provably secure against adaptive chosen ciphertext attack (as defined by Rackoff and Simon [20]). The scheme is quite practical, requiring just a few exponentiations over a group. Moreover, the proof of security relies only on a standard intractability assumption, namely, the hardness of the Di...
متن کاملA Unified Methodology For Constructing Public-Key Encryption Schemes Secure Against Adaptive Chosen-Ciphertext Attack
We introduce a new methodology for achieving security against adaptive chosen-ciphertext attack (CCA) for public-key encryption schemes, which we call the oblivious decryptors model. The oblivious decryptors model generalizes both the two-key model of Naor and Yung, as well the Cramer–Shoup encryption schemes. The key ingredient in our new paradigm is Sahai’s notion of Simulation-Sound NIZK pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2001 شماره
صفحات -
تاریخ انتشار 2001